Characterisation of self-complementary chordal graphs

Characterisation of self-complementary chordal graphs

In this note we prove that a self-complementary graph with p vertices is chordal if and only if its clique number is integral part of (p + 1)/2. (~) 1998 Elsevier Science B.V. All rights reserved

On Self-complementary Chordal Graphs Defined by Single Forbidden Induced Subgraph

In this paper we deal with several subclasses of self complementary chordal graphs characterized by single forbidden induced subgraph namely Chairfree sc chordal graphs, H-free sc chordal graphs and Cross (star1, 1, 1, 2)-free sc chordal graphs. We obtain some results on these classes and an algorithm is proposed based on these results that recognize these classes. We also compile a catalogue o...

Almost Self-centered Median and Chordal Graphs

Almost self-centered graphs were recently introduced as the graphs with exactly two non-central vertices. In this paper we characterize almost selfcentered graphs among median graphs and among chordal graphs. In the first case P4 and the graphs obtained from hypercubes by attaching to them a single leaf are the only such graphs. Among chordal graph the variety of almost self-centered graph is m...

Self-complementary circulant graphs

Self-Complementary Vertex-Transitive Graphs

A graph Γ is self-complementary if its complement is isomorphic to the graph itself. An isomorphism that maps Γ to its complement Γ is called a complementing isomorphism. The majority of this dissertation is intended to present my research results on the study of self-complementary vertex-transitive graphs. I will provide an introductory mini-course for the backgrounds, and then discuss four pr...